Multi-level Distance Labelings for Generalized Petersen Graph
نویسندگان
چکیده
1 Department of Mathematics, Lahore College for Women University, Lahore-Pakistan E-mail: [email protected] 2 Department of Mathematics, Lahore College for Women University, Lahore-Pakistan E-mail: [email protected] 3* Division of Science and Technology, University of Education, Township Lahore-Pakistan E-mail: [email protected] ABSTRACT: Let G be a connected graph with diameter diam ( ) G and ( , ) d x y denotes the shortest
منابع مشابه
Graceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملSIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL
Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.
متن کاملOn the Total Irregularity Strength of Generalized Petersen Graph
As a standard notation, assume that G = G(V,E) is a finite, simple and undirected graph with p vertices and q edges. A labeling of a graph is any mapping that sends some set of graph elements to a set of numbers (usually positive integers). If the domain is the vertex-set or the edge-set, the labelings are called respectively vertex-labelings or edge-labelings. If the domain is V ∪E then we cal...
متن کاملThe lower bound for the number of 1-factors in generalized Petersen graphs
In this paper, we investigate the number of 1-factors of a generalized Petersen graph $P(N,k)$ and get a lower bound for the number of 1-factors of $P(N,k)$ as $k$ is odd, which shows that the number of 1-factors of $P(N,k)$ is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
متن کاملα-labelings of a class of generalized Petersen graphs
An α-labeling of a bipartite graph Γ of size e is an injective function f : V (Γ) → {0, 1, 2, . . . , e} such that {|f(x) − f(y)| : [x, y] ∈ E(Γ)} = {1, 2, . . . , e} and with the property that its maximum value on one of the two bipartite sets does not reach its minimum on the other one. We prove that the generalized Petersen graph P8n,3 admits an α-labeling for any integer n ≥ 1 confirming th...
متن کامل